/**
 * @author wtcode
 * @date 2021/3/8 - 15:05
 */
public class Quick_Sort_Demo {

    public void qucik_sort(int[] nums, int l ,int r){
        if(l+1 > r){
            return;
        }
        int first = l;
        int last = r-1;
        int key = nums[first];

        while (first < last){
            while (first < last && nums[last] >= key){
                --last;
            }

        }

    }


}
